1,599 research outputs found
Approximate tensor-product preconditioners for very high order discontinuous Galerkin methods
In this paper, we develop a new tensor-product based preconditioner for
discontinuous Galerkin methods with polynomial degrees higher than those
typically employed. This preconditioner uses an automatic, purely algebraic
method to approximate the exact block Jacobi preconditioner by Kronecker
products of several small, one-dimensional matrices. Traditional matrix-based
preconditioners require storage and
computational work, where is the degree of basis polynomials used, and
is the spatial dimension. Our SVD-based tensor-product preconditioner requires
storage, work in two spatial
dimensions, and work in three spatial dimensions.
Combined with a matrix-free Newton-Krylov solver, these preconditioners allow
for the solution of DG systems in linear time in per degree of freedom in
2D, and reduce the computational complexity from to
in 3D. Numerical results are shown in 2D and 3D for the
advection and Euler equations, using polynomials of degree up to . For
many test cases, the preconditioner results in similar iteration counts when
compared with the exact block Jacobi preconditioner, and performance is
significantly improved for high polynomial degrees .Comment: 40 pages, 15 figure
What is a place? Allowing users to name and define places
From working with location-based information systems we know that positioning is problematic. A different approach was tested, where users themselves were allowed to name and define the places they wanted to use. The question was if they would do so, and if they would understand the notion of “place”. In a user study, 78 users created 84 place labels. The user study also gave us some unexpected input to the users’ perception of place: not only physical, but also virtual places were created
- …